The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
نویسندگان
چکیده
Both the hopcount HN (the number of links) and the weight WN (the sum of the weights on links) of the shortest path between two arbitrary nodes in the complete graph KN with i.i.d. exponential link weights is computed. We consider the joint distribution of the pair (HN,WN ) and derive, after proper scaling, the joint limiting distribution. One of the results is that HN and WN , properly scaled, are asymptotically independent.
منابع مشابه
First passage percolation on locally treelike networks. I. Dense random graphs
We study various properties of least cost paths under independent and identically distributed !iid" disorder for the complete graph and dense Erdős–Rényi random graphs in the connected phase, with iid exponential and uniform weights on edges. Using a simple heuristic, we compute explicitly limiting distributions for !properly recentered" lengths of shortest paths between typical nodes as well a...
متن کاملA Note on the Weight of Multicast Shortest Path Trees
The weight of a multicast shortest path tree in the complete graph with exponential link weights is expressed as a random variable. The new framework elegantly allows the computation of the average multicast weight.
متن کاملUsing a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کاملUniversality for first passage percolation on sparse random graphs
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a uniform X logX-condition, we analyze the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well the number of edges...
متن کاملThe weight of the shortest path tree
The minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights, is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2008